On Testing Irreflexivity of Reduction Orderings for Combined Substitutions in Intuitionistic Matrix Proofs
نویسندگان
چکیده
P. Baumgartner, R. Hähnle & J. Posegga, eds., 4 Workshop on Theorem Proving with Analytic Tableaux and Related Methods (TABLEAUX’95) – Short Papers & Poster Sessions, Universität Koblenz, Mai 1995, pp. 55-60. Abstract. In this paper we present a syntactical criterion for checking irreflexivity of the reduction ordering imposed by so–called combined substitutions which are part of the Matrix characterisation for first–order intuitionistic logic as presented by L. Wallen. The solution presented here is the concept of variable domains that can be considered as an extension of the well–known occurs–check technique.
منابع مشابه
Generalization of Szpilrajn's Theorem on Intuitionistic Fuzzy Matrix
In this paper, intuitionistic fuzzy matrices are considered. Szpilrajn's theorem on orderings is generalized to intuitionistic fuzzy orderings by Zedam et al. We give another generalization in intuitionistic fuzzy matrix form and theorem is represented in terms of intuitionistic fuzzy matrix operations.
متن کاملAn interval-valued programming approach to matrix games with payoffs of triangular intuitionistic fuzzy numbers
The purpose of this paper is to develop a methodology for solving a new type of matrix games in which payoffs are expressed with triangular intuitionistic fuzzy numbers (TIFNs). In this methodology, the concept of solutions for matrix games with payoffs of TIFNs is introduced. A pair of auxiliary intuitionistic fuzzy programming models for players are established to determine optimal strategies...
متن کامل(T,S)-BASED INTERVAL-VALUED INTUITIONISTIC FUZZY COMPOSITION MATRIX AND ITS APPLICATION FOR CLUSTERING
In this paper, the notions of $(T,S)$-composition matrix and$(T,S)$-interval-valued intuitionistic fuzzy equivalence matrix areintroduced where $(T,S)$ is a dual pair of triangular module. Theyare the generalization of composition matrix and interval-valuedintuitionistic fuzzy equivalence matrix. Furthermore, theirproperties and characterizations are presented. Then a new methodbased on $tilde{...
متن کاملProof-term synthesis on dependent-type systems via explicit substitutions
Typed A-terms are used as a compact and linear representation of proofs in intuitionistic logic. This is possible since the Curry-Howard isomorphism relates proof trees with typed A-terms. The proofs-as-terms principle can be used to check a proof by type checking the A-term extracted from the complete proof tree. However, proof trees and typed A-terms are built differently. Usually, an auxilia...
متن کاملBI-MATRIX GAMES WITH INTUITIONISTIC FUZZY GOALS
In this paper, we present an application of intuitionistic fuzzyprogramming to a two person bi-matrix game (pair of payoffs matrices) for thesolution with mixed strategies using linear membership and non-membershipfunctions. We also introduce the intuitionistic fuzzy(IF) goal for a choiceof a strategy in a payoff matrix in order to incorporate ambiguity of humanjudgements; a player wants to max...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995